Pattern Mining on Stars with FP-Growth
نویسندگان
چکیده
Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple tables. In recent years, the most common DM techniques have been extended to the multi-relational case, but there are few dedicated to star schemas. These schemas are composed of a central fact table, linking a set of dimension tables, and joining all the tables before mining may not be a feasible solution. This work proposes a method for frequent pattern mining in a star schema based on FP-Growth. It does not materialize the entire join between the tables. Instead, it constructs an FP-Tree for each dimension and then combines them to form a super FP-Tree, that will serve as input to FP-Growth.
منابع مشابه
Gallbladder Segmentation in 2-D Ultrasound Images Using Deformable Contour Methods
o Gallbladder Segmentation in 2-D Ultrasound Images using Deformable Contour Methods M. Ciecholewski o Pattern Mining on Stars with FP-Growth A. Silva, C. Antunes o Non-hierarchical Clustering of Decision Tables toward Rough Set-based Group Decision Aid M. Inuiguchi, R. Enomoto, Y. Kusunoki o An Enhanced Framework Of Subjective Logic For Semantic Document Analysis S. Manna, B. Sumudu. U. Mendis...
متن کاملA Frequent Pattern Mining Algorithm Based on Fp-tree Structure Andapriori Algorithm
Association rule mining is used to find association relationships among large data sets. Mining frequent patterns is an importantaspect in association rule mining. In this paper, an algorithm named Apriori-Growth based on Apriori algorithm and the FP-tree structure is presented to mine frequent patterns. The advantage of the Apriori-Growth algorithm is that it doesn’t need to generate condition...
متن کاملMining Stars with FP-Growth: a Case Study on Bibliographic Data
Traditional data mining approaches look for patterns in a single table, while multirelational data mining aims for identifying patterns that involve multiple tables. In recent years, the most common mining techniques have been extended to the multirelational context, but there are few dedicated to deal with data stored following the multi-dimensional model, in particular the star schema. These ...
متن کاملAn Enhanced Frequent Pattern Growth Based on Mapreduce for Mining Association Rules
In mining frequent itemsets, one of most important algorithm is FP-growth. FP-growth proposes an algorithm to compress information needed for mining frequent itemsets in FP-tree and recursively constructs FP-trees to find all frequent itemsets. In this paper, we propose the EFP-growth (enhanced FPgrowth) algorithm to achieve the quality of FP-growth. Our proposed method implemented the EFPGrowt...
متن کاملConcurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm
Discovery of frequent itemsets is a very important data mining problem with numerous applications. Frequent itemset mining is often regarded as advanced querying where a user specifies the source dataset and pattern constraints using a given constraint model. A significant amount of research on frequent itemset mining has been done so far, focusing mainly on developing faster complete mining al...
متن کامل